3D Equivariant Graph Implicit Functions
نویسندگان
چکیده
AbstractIn recent years, neural implicit representations have made remarkable progress in modeling of 3D shapes with arbitrary topology. In this work, we address two key limitations such representations, failing to capture local geometric fine details, and learn from generalize unseen transformations. To end, introduce a novel family graph functions equivariant layers that facilitates details guaranteed robustness various groups transformations, through k-NN embeddings sparse point set observations at multiple resolutions. Our method improves over the existing rotation-equivariant function 0.69 0.89 (IoU) on ShapeNet reconstruction task. We also show our can be extended other types similarity transformations generalizes translations scaling.KeywordsImplicit representationsEquivarianceGraph networks3D reconstructionTransformation
منابع مشابه
Modeling of Infinite Divisible Distributions Using Invariant and Equivariant Functions
Basu’s theorem is one of the most elegant results of classical statistics. Succinctly put, the theorem says: if T is a complete sufficient statistic for a family of probability measures, and V is an ancillary statistic, then T and V are independent. A very novel application of Basu’s theorem appears recently in proving the infinite divisibility of certain statistics. In addition ...
متن کاملInteractive 3D medical image segmentation with energy-minimizing implicit functions
We present an interactive segmentation method for three-dimensional medical images that reconstructs the surface of an object using energy-minimizing, smooth, implicit functions. This reconstruction problem is called variational interpolation. For an intuitive segmentation of medical images, variational interpolation can be based on a set of user-drawn, planar contours that can be arbitrarily o...
متن کاملPattern Equivariant Functions and Cohomology
The cohomology of a tiling or a point pattern has originally been defined via the construction of the hull or the groupoid associated with the tiling or the pattern. Here we present a construction which is more direct and therefore easier accessible. It is based on generalizing the notion of equivariance from lattices to point patterns of finite local complexity.
متن کاملAPPROXIMATION OF 3D-PARAMETRIC FUNCTIONS BY BICUBIC B-SPLINE FUNCTIONS
In this paper we propose a method to approximate a parametric 3 D-function by bicubic B-spline functions
متن کاملGraph-chromatic Implicit Relations
A theory about the implication structure in graph coloring is presented. Discovering hidden relations is a crucial activity in every scientific discipline. The development of mathematical models to study and discover such hidden relations is of the most highest interest. The main contribution presented in this work is a model of hidden relations materialized as implicitedges and implicit-identi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-20062-5_28